DeepTuner : A System for Search Technique Recommendation in Program
نویسنده
چکیده
OpenTuner can help users achieve better or more portable performance in their speci c domain through program autotuning. A key challenge for users seeking good autotuning performance in OpenTuner is selecting a search approach appropriate for problem. However, not only are current in-situ learning search approaches not robust enough to handle all search spaces, but there are also too many possible search approaches for a user to examine manually after factoring in composable techniques. In this thesis, we introduce DeepTuner, a system for search approach recommendation operating across OpenTuner autotuning sessions to facilitate development of robust transfer learning search approaches. By utilizing historical autotuning data via DeepTuner's technique recommendation endpoints, the new search approaches can e ciently explore the space of possible search approaches and the autotuning space simultaneously, resulting in an adaptive, self-improving search approach. We demonstrate the robustness that recommendation brings on nine problems spread over three domains for a variety of initial technique sets. In particular, we show that the new Database Initialized Recommendation Bandit Meta-technique is highly robust, performing on par or signi cantly better than various old in-situ search approaches in OpenTuner. We achieve up to 3.7x performance improvement over the old default in-situ search approach for OpenTuner in the TSP domain.
منابع مشابه
DeepTuner: A System for Search Technique Recommendation in Program Autotuning
OpenTuner can help users achieve better or more portable performance in their speci c domain through program autotuning. A key challenge for users seeking good autotuning performance in OpenTuner is selecting a search approach appropriate for problem. However, not only are current in-situ learning search approaches not robust enough to handle all search spaces, but there are also too many possi...
متن کاملDiscovering Popular Clicks\' Pattern of Teen Users for Query Recommendation
Search engines are still the most important gates for information search in internet. In this regard, providing the best response in the shortest time possible to the user's request is still desired. Normally, search engines are designed for adults and few policies have been employed considering teen users. Teen users are more biased in clicking the results list than are adult users. This leads...
متن کاملA multi Agent System Based on Modified Shifting Bottleneck and Search Techniques for Job Shop Scheduling Problems
This paper presents a multi agent system for the job shop scheduling problems. The proposed system consists of initial scheduling agent, search agents, and schedule management agent. In initial scheduling agent, a modified Shifting Bottleneck is proposed. That is, an effective heuristic approach and can generate a good solution in a low computational effort. In search agents, a hybrid search ap...
متن کاملDesign and implementation of a WEBGIS-based recommendation system based on context-awareness for tourism planning
Today, tourism is one of the most lucrative industries in the world. Due to the large amount of information that exists about the points of Interest (POI) of a city, the tourist is faced with an overload of information. As a result, a recommending system is needed to recommend suitable tourist places to the tourist in the shortest time. In order to offer a better offer, the interests and contex...
متن کاملOptimization of Conventional Stabilizers Parameter of Two Machine Power System Linked by SSSC Using CHSA Technique
This paper presents a method for damping of low frequency oscillations (LFO) in a power system. The powersystem contains static synchronous series compensators (SSSC) which using a chaotic harmony searchalgorithm (CHSA), optimizes the lead-lag damping stabilizer. In fact, the main target of this paper isoptimization of selected gains with the time domain-based objective function, which is solve...
متن کامل